https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:4319 Wed 11 Apr 2018 16:02:38 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:8153 Sat 24 Mar 2018 08:36:06 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11673 Sat 24 Mar 2018 08:08:43 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:68 Sat 24 Mar 2018 07:42:02 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:23800 order/degree problem, that is, to determine the smallest diameter of a digraph given order and maximum out-degree. There is no general efficient algorithm known for the construction of such optimal digraphs but various construction techniques for digraphs with minimum diameter have been proposed. In this paper, we survey the known techniques.]]> Fri 06 Oct 2023 15:41:42 AEDT ]]>